Diversified Spatial Keyword Search On Road Networks
نویسندگان
چکیده
With the increasing pervasiveness of the geo-positioning technologies, there is an enormous amount of spatio-textual objects available in many applications such as location based services and social networks. Consequently, various types of spatial keyword searches which explore both locations and textual descriptions of the objects have been intensively studied by the research communities and commercial organizations. In many important applications (e.g., location based services), the closeness of two spatial objects is measured by the road network distance. Moreover, the result diversification is becoming a common practice to enhance the quality of the search results. Motived by the above facts, in this paper we study the problem of diversified spatial keyword search on road networks which considers both the relevance and the spatial diversity of the results. An efficient signature-based inverted indexing technique is proposed to facilitate the spatial keyword query processing on road networks. Then we develop an efficient diversified spatial keyword search algorithm by taking advantage of spatial keyword pruning and diversity pruning techniques. Comprehensive experiments on real and synthetic data clearly demonstrate the efficiency of our methods.
منابع مشابه
DISKs: A System for Distributed Spatial Group Keyword Search on Road Networks
Query (e.g., shortest path) on road networks has been extensively studied. Although most of the existing query processing approaches are designed for centralized environments, there is a growing need to handle queries on road networks in distributed environments due to the increasing query workload and the challenge of querying large networks. In this demonstration, we showcase a distributed sy...
متن کاملeSPAK: Top-K Spatial Keyword Query Processing in Directed Road Networks
Given a query location and a set of query keywords, a top-k spatial keyword query rank objects based on the distance to the query location and textual relevance to the query keywords. Several solutions have been proposed for top-k spatial keyword queries in Euclidean space. However, few algorithms study top-k keyword queries in undirected road networks where every road segment is undirected. Ev...
متن کاملEfficient Reverse Top-k Boolean Spatial Keyword Queries on Road Networks
Reverse k nearest neighbor (RkNN) queries have a broad application base such as decision support, profile-based marketing, and resource allocation. Previous work on RkNN search does not take textual information into consideration or limits to the Euclidean space. In the real world, however, most spatial objects are associated with textual information and lie on road networks. In this paper, we ...
متن کاملDistributed Spatial Keyword Querying on Road Networks
Spatial-keyword queries on road networks are receiving increasing attention with the prominence of location-based services. There is a growing need to handle queries on road networks in distributed environments because a large network is typically distributed over multiple machines and it will improve query throughput. However, all the existing work on spatial keyword queries is based on a cent...
متن کاملContinuous Monitoring of Top- k Spatial Keyword Queries in Road Networks
Recently, spatial keyword queries (SKQ) have become a hot topic in database field. However, Most of the existing SKQ methods are limited in Euclidean space or assume that objects (and queries) are static. This paper addresses the issue of processing continuous top-k spatial keyword queries over moving objects (CMTkSK) in road networks. To efficiently index moving geo-textual objects in road net...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014